Computing deep facet-defining disjunctive cuts for mixed-integer programming
نویسندگان
چکیده
منابع مشابه
Computing deep facet-defining disjunctive cuts for mixed-integer programming
The problem of separation is to find an affine hyperplane, or “cut”, that lies between the origin O and a given closed convex set Q in a Euclidean space. We focus on cuts which are deep for the Euclidean distance, and facet-defining. The existence of a unique deepest cut is shown and cases when it is decomposable as a combination of facet-defining cuts are characterized using the reverse polar ...
متن کاملDisjunctive Cuts for Mixed Integer Nonlinear Programming Problems
We survey recent progress in applying disjunctive programming theory for the effective solution of mixed integer nonlinear programming problems. Generation of effective cutting planes is discussed for both the convex and nonconvex cases.
متن کاملLocal cuts for mixed-integer programming
A general framework for cutting-plane generation was proposed by Applegate et al. in the context of the traveling salesman problem. The process considers the image of a problem space under a linear mapping, chosen so that a relaxation of the mapped problem can be solved efficiently. Optimization in the mapped space can be used to find a separating hyperplane if one exists, and via substitution ...
متن کاملGenerating Disjunctive Cuts for Mixed Integer Programs — Doctoral Dissertation
This report constitutes the Doctoral Dissertation for Michael Perregaard and is a collection of results on the efficient generation of disjunctive cuts for mixed integer programs. Disjunctive cuts is a very broad class of cuts for mixed integer programming. In general, any cut that can be derived from a disjunctive argument can be considered a disjunctive cut. Here we consider specifically cuts...
متن کاملDisjunctive Conic Cuts for Mixed Integer Second Order Cone Optimization
We investigate the derivation of disjunctive conic cuts for mixed integer second order cone optimization (MISOCO). These conic cuts characterize the convex hull of the intersection of a disjunctive set and the feasible set of a MISOCO problem. We present a full characterization of these inequalities when the disjunctive set considered is defined by parallel hyperplanes.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2008
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-008-0245-6